Classifications of recurrence relations via subclasses of (H, m)– quasiseparable matrices

نویسندگان

  • T. Bella
  • V. Olshevsky
  • P. Zhlobich
چکیده

The results on characterization of orthogonal polynomials and Szegö polynomials via tridiagonal matrices and unitary Hessenberg matrices, resp., are classical. In a recent paper we observed that tridiagonal matrices and unitary Hessenberg matrices both belong to a wide class of (H, 1)–quasiseparable matrices and derived a complete characterization of the latter class via polynomials satisfying certain EGO–type recurrence relations. We also established a characterization of polynomials satisfying three–term recurrence relations via (H, 1)–well–free matrices and of polynomials satisfying the Szegö–type two-term recurrence relations via (H, 1)–semiseparable matrices. In this paper we generalize all of these results from scalar (H,1) to the block (H,m) case. Specifically, we provide a complete characterization of (H, m)–quasiseparable matrices via polynomials satisfying block EGO–type two–term recurrence relations. Further, (H, m)–semiseparable matrices are completely characterized by the polynomials obeying block Szegö–type recurrence relations. Finally, we completely characterize polynomials satisfying m–term recurrence relations via a new class of matrices called (H, m)– well–free matrices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizations of Quasiseparable Matrices and Their Subclasses via Recurrence Relations and Signal Flow Graphs

The three-term recurrence relations satisfied by real-orthogonal polynomials (related to irreducible tridiagonal matrices) and the twoand three-term recurrence relations satisfied by the Szegö polynomials (related to unitary Hessenberg matrices) are all well-known. In this paper we consider more general twoand three-term recurrence relations, and prove that the related classes of matrices are a...

متن کامل

A Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices

The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasise...

متن کامل

Eigenstructure of Order-One-Quasiseparable Matrices. Three-term and Two-term Recurrence Relations

This paper presents explicit formulas and algorithms to compute the eigenvalues and eigenvectors of order-one-quasiseparable matrices. Various recursive relations for characteristic polynomials of their principal submatrices are derived. The cost of evaluating the characteristic polynomial of an N × N matrix and its derivative is only O(N). This leads immediately to several versions of a fast q...

متن کامل

A Traub–like algorithm for Hessenberg-quasiseparable-Vander- monde matrices of arbitrary order

Although Gaussian elimination uses O(n) operations to invert an arbitrary matrix, matrices with a special Vandermonde structure can be inverted in only O(n) operations by the fast Traub algorithm. The original version of Traub algorithm was numerically unstable although only a minor modification of it yields a high accuracy in practice. The Traub algorithm has been extended from Vandermonde mat...

متن کامل

Computations with quasiseparable polynomials and matrices

In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices generalize two classical matrix classes, Jacobi (tridiagonal) matrices and unitary Hessenberg matrices that are known to correspond to real orthogonal polynomials and Szegö polynomials, resp. The latter two polynomial famil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008